Program transformations using temporal logic side conditions
نویسندگان
چکیده
منابع مشابه
A Logic for Correlating Temporal Properties across Program Transformations
Program transformations are widely used in synthesis, optimization, and maintenance of software. Correctness of program transformations depends on preservation of some important properties of the input program. By regarding programs as Kripke structures, many interesting properties of programs can be expressed in temporal logics. In temporal logic, a formula is interpreted on a single program. ...
متن کاملVeri cation of Parameterized Systems Using Logic Program Transformations?
We show how the problem of verifying parameterized systems can be reduced to the problem of determining the equivalence of goals in a logic program. We further show how goal equivalences can be established using induction-based proofs. Such proofs rely on a powerful new theory of logic program transformations (encompassing unfold, fold and goal replacement over multiple recursive clauses), can ...
متن کاملVerification of Parameterized Systems Using Logic Program Transformations
We show how the problem of verifying parameterized systems can be reduced to the problem of determining the equivalence of goals in a logic program. We further show how goal equivalences can be established using induction-based proofs. Such proofs rely on a powerful new theory of logicprogram transformations (encompassing unfold, fold and goal replacement over multiple recursive clauses), can b...
متن کاملAutomatic Correctness Proofs for Logic Program Transformations
The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-founded orderings with the proof trees of the atoms belonging to the least Herbrand models of the programs. In practice, these orderings are given by ‘clause measures’, that is, measures associated with the clauses of the program...
متن کاملA Logic Foundation for Program Transformations
This paper presents a uniform foundation for representing, analysing and transforming programs and models. It is firmly grounded on logic and defines a seamless integration of declarative analyses and of transformations based on these analyses. As such it is an entirely novel approach that recommends itself as an alternative to known transformation formalisms and possibly a unifying framework f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Programming Languages and Systems
سال: 2009
ISSN: 0164-0925,1558-4593
DOI: 10.1145/1516507.1516509